首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   245篇
  免费   3篇
  国内免费   18篇
化学   4篇
力学   9篇
数学   246篇
物理学   7篇
  2024年   1篇
  2023年   3篇
  2022年   8篇
  2021年   4篇
  2020年   4篇
  2019年   5篇
  2018年   10篇
  2017年   3篇
  2016年   6篇
  2015年   5篇
  2014年   9篇
  2013年   17篇
  2012年   13篇
  2011年   15篇
  2010年   10篇
  2009年   17篇
  2008年   9篇
  2007年   12篇
  2006年   6篇
  2005年   11篇
  2004年   8篇
  2003年   7篇
  2002年   9篇
  2001年   5篇
  2000年   5篇
  1999年   3篇
  1998年   3篇
  1997年   6篇
  1996年   6篇
  1995年   2篇
  1994年   4篇
  1993年   1篇
  1992年   1篇
  1991年   2篇
  1990年   4篇
  1988年   1篇
  1987年   4篇
  1986年   2篇
  1985年   3篇
  1984年   5篇
  1983年   1篇
  1982年   2篇
  1981年   2篇
  1980年   2篇
  1978年   2篇
  1977年   1篇
  1973年   1篇
  1971年   1篇
  1970年   2篇
  1969年   3篇
排序方式: 共有266条查询结果,搜索用时 15 毫秒
21.
The notion of an absolute fixed point set in the setting of continuum-valued maps will be defined and characterized.

  相似文献   

22.
We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality and discuss applications of the theorem.  相似文献   
23.
A statistic is found to combinatorially generate the cycle-counting q-hit numbers, defined algebraically by Haglund [Adv. in Appl. Math. 17 (1996) 408–459]. We then define the notion of a cycle-Mahonian pair of statistics (generalizing that of a Mahonian statistic), and show that our newly discovered statistic is part of such a pair. Finally, we note a second example of a cycle-Mahonian pair of statistics which leads us to define the stronger property of being a cycle-Euler–Mahonian pair.  相似文献   
24.
The following results are obtained. (i) Let p, d, and k be fixed positive integers, and let G be a graph whose vertex set can be partitioned into parts V1, V2,…, Va such that for each i at most d vertices in V1Vi have neighbors in Vi+1 and r(Kk, Vi) p | V(G) |, where Vi denotes the subgraph of G induced by Vi. Then there exists a number c depending only on p, d, and k such that r(Kk, G)c | V(G) |. (ii) Let d be a positive integer and let G be a graph in which there is an independent set I V(G) such that each component of GI has at most d vertices and at most two neighbors in I. Then r(G,G)c | V(G) |, where c is a number depending only on d. As a special case, r(G, G) 6 | V(G) | for a graph G in which all vertices of degree at least three are independent. The constant 6 cannot be replaced by one less than 4.  相似文献   
25.
We examine an asymptotic expansion of the time dependent displacement field of a solid, three-dimensional elastic arch. We show that it is possible to derive from the principles of virtual work four different models of arches. We also show that the approximate equations of motion are universal within a class of homogeneous, hyperelastic materials provided that the deformations of the solid arch are not too large.  相似文献   
26.
27.
28.
29.
In this paper a general identity is proved which includes among its special cases a recurrence formula for Catalan numbers given by J. Touchard in 1924.  相似文献   
30.
   Abstract. Subdivision with finitely supported masks is an efficient method to create discrete multiscale representations of smooth surfaces for CAGD applications. Recently a new subdivision scheme for triangular meshes, called
-subdivision , has been studied. In comparison to dyadic subdivision, which is based on the dilation matrix 2I ,
-subdivision is based on a dilation M with det M=3 . This has certain advantages, for example, a slower growth for the number of control points. This paper concerns the problem of achieving maximal sum rule orders for stationary
-subdivision schemes with given mask support, which is important because the sum rule order characterizes the order of the polynomial reproduction, and provides an upper bound on the Sobolev smoothness of the surface. We study both interpolating and approximating schemes for a natural family of symmetric mask support sets related to squares of sidelength 2n in Z 2 , and obtain exact formulas for the maximal sum rule order for arbitrary n . For approximating schemes, the solution is simple, and schemes with maximal sum rule order are realized by an explicit family of schemes based on repeated averaging [15]. In the interpolating case, we use properties of multivariate Lagrange polynomial interpolation to prove the existence of interpolating schemes with maximal sum rule orders. These can be found by solving a linear system which can be reduced in size by using symmetries. From this, we construct some new examples of smooth (C 2 ,C 3 ) interpolating
-subdivision schemes with maximal sum rule order and symmetric masks. The construction of associated dual schemes is also discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号